Int Reduction
نویسنده
چکیده
Naive-Bayes induction algorithms were previously shown to be surprisingly accurate on many classification tasks even when the conditional independence assumption on which they are based is violated. However, most studies were done on small databases. We show that in some larger databases, the accuracy of Naive-Bayes does not scale up as well as decision trees. We then propose a new algorithm, NBTree, which induces a hybrid of decision-tree classifiers and NaiveBayes classifiers: the decision-tree nodes contain univariate splits as regular decision-trees, but the leaves contain Naive-Bayesian classifiers. The approach retains the interpretability of Naive-Bayes and decision trees, while resulting in classifiers that frequently outperform both constituents, especially in the larger databases tested.
منابع مشابه
Fundamental oscillation up to 1.08THz in resonant tunneling diodes with high-indium-composition transit layers for reduction of transit delay
Fundamental oscillations up to 1.08 THz with the output power of 5.5 microwatts was achieved in GalnAs/AlAs resonant tunneling diodes (RTDs) at room temperature. The graded emitter, thin barriers, and high-indium-composition transit layers were introduced to reduce the tunneling and transit delays. The first two of these structures are the same as those in RTDs oscillating at 1.04 THz reported ...
متن کاملFeature extraction for nearest neighbor classification: Application to gender recognition
In this article, we perform an extended analysis of different face-processing techniques for gender recognition problems. Prior research works show that support vector machines (SVM) achieve the best classification results. We will show that a nearest neighbor classification approach can reach a similar performance or improve the SVM results, given an adequate selection of features of the input...
متن کاملDevelopment of Neural Networks for Noise Reduction
This paper describes the development of neural network models for noise reduction. The networks used to enhance the performance of modeling captured signals by reducing the effect of noise. Both recurrent and multi-layer Backpropagation neural networks models are examined and compared with different training algorithms. The paper presented is to illustrate the effect of training algorithms and ...
متن کاملThe Soundness of Explicit Substitution with Nameless Variables
We show the soundness of a-calculus B where de Bruijn indices are used, substitution is explicit, and reduction is step-wise. This is done by interpreting B in the classical calculus where the explicit substitution becomes implicit and de Bruijn indices become named variables. This is the rst at semantics of explicit substitution and step-wise reduction and the rst clear account of exactly when...
متن کاملA New Optimum-Word-Length-Assignment (OWLA) Multiplierless Integer DCT for Unified Lossless/Lossy Image Coding
Recently, we proposed a new multiplierless 1D Int-DCT modified from our existing Int-DCT by approximating floating multiplications to bit-shift and addition operations. The multiplierless 1D Int-DCT can be well operated both lossless coding and lossy coding. However, our multiplierless 1D Int-DCT is not focused on how to assign word-length for floating-multiplier approximation as short as possi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999